package 牛客_面试必刷.Month07.day09;

public class 寻找峰值 {
    public int findPeakElement (int[] nums) {
        // write code here
        //请注意，这题没有想象中的那么复杂
        int left = 0,right = nums.length - 1;
        while(left < right){
            int mid = left + (right - left) / 2;
            if(nums[mid] < nums[mid + 1]){
                left = mid + 1;
            }else{
                right = mid;
            }
        }
        return left;
    }
}
